Poisson approximation for two scan statistics with rates of convergence
نویسندگان
چکیده
منابع مشابه
2 Poisson approximation for U - max - statistics
In 1948, W. Hoeffding introduced a large class of unbiased estimators called U -statistics, defined as the average value of a real-valued k-variate function h calculated at all possible sets of k points from a random sample. In the present paper we investigate the corresponding extreme value analogue, which we shall call U -max-statistics. We are concerned with the behavior of the largest value...
متن کاملAsymptotic theory for statistics of the Poisson-Voronoi approximation
This paper establishes expectation and variance asymptotics for statistics of the Poisson-Voronoi approximation of general sets, as the underlying intensity of the Poisson point process tends to infinity. Statistics of interest include volume, surface area, Hausdorff measure, and the number of faces of lower-dimensional skeletons. We also consider the complexity of the so-called Voronoi zone an...
متن کاملOn Conditions for Convergence Rates of Stochastic Approximation Algorithms
We develop deterministic necessary and sufficient conditions on individual noise sequences of a stochastic approximation algorithm for the error of the iterates to converge at a given rate. Specifically, suppose {p,} is a given positive sequence converging monotonically to 0. Consider a stochastic approximation algorithm x,+1 = x, an(Anxn b,) + anen, where (2,) is the iterate sequence, {a,} is ...
متن کاملConvergence Rates for Adaptive Weak Approximation of Stochastic Differential Equations
Convergence rates of adaptive algorithms for weak approximations of Itô stochastic differential equations are proved for the Monte Carlo Euler method. Two algorithms based either on optimal stochastic time steps or optimal deterministic time steps are studied. The analysis of their computational complexity combines the error expansions with a posteriori leading order term introduced in Szepessy...
متن کاملNoise Conditions for Prespecified Convergence Rates of Stochastic Approximation Algorithms
We develop deterministic necessary and sufficient conditions on individual noise sequences of a stochastic approximation algorithm for the error of the iterates to converge at a given rate. Specifically, suppose f ng is a given positive sequence converging monotonically to zero. Consider a stochastic approximation algorithm xn+1 = xn an(Anxn bn) + anen , where fxng is the iterate sequence, fang...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2016
ISSN: 1050-5164
DOI: 10.1214/15-aap1150